منابع مشابه
IV-matching is strongly NP-hard
IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem at the ICALP 2014 conference. In this note, we resolve the question and prove that, contrary to the expectations of the authors, the given problem is strongly NP-hard (already in the simplest non-trivial case of four layers). Hence it is unlikely that the...
متن کاملThe Periodic Joint Replenishment Problem is Strongly NP-Hard
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years and many heuristic and approximation algorithms were suggested. However, in spite of the vast effort, the complexity of the problem remained unr...
متن کاملFlattening Fixed-Angle Chains Is Strongly NP-Hard
Planar configurations of fixed-angle chains and trees are well studied in polymer science and molecular biology. We prove that it is strongly NP-hard to decide whether a polygonal chain with fixed edge lengths and angles has a planar configuration without crossings. In particular, flattening is NP-hard when all the edge lengths are equal, whereas a previous (weak) NP-hardness proof used lengths...
متن کاملStrongly NP-Hard Discrete Gate Sizing Problems
The discrete gate sizing problem has been studied by several researchers recently. Some Complexity results have been obtained, ana' a number of heuristic algorithms have been proposed. For circuit networks that are restricted to the set of trees, or series-parallel graphs pseudo-polynomial time algorithms to obtain the exact solution have also been proposed, though none can be extended to arbit...
متن کاملComputing the maximum matching width is NP-hard
The maximum matching width is a graph width parameter that is defined on a branchdecomposition over the vertex set of a graph. In this short paper, we prove that the problem of computing the maximum matching width is NP-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2017
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2017.04.014